Upper Bounds for Large Scale Integer Quadratic Multidimensional Knapsack Problems
نویسندگان
چکیده
We consider the separable quadratic multi-knapsack problem (QMKP) which consists in maximizing a concave separable quadratic integer function subject to m linear capacity constraints. The aim of this paper is to develop an effective method to compute an upper bound for (QMKP) from a surrogate relaxation originally proposed in Djerdjour et al. (1988). The quality of three other upper bounds for (QMKP) is evaluated and they are compared theoretically and experimentally with the bound we suggest. An effective heuristic method is presented to obtain a good feasible solution for (QMKP). Finally, computational experiments are reported. They assess the efficiency of our upper bound for instances up to 2000 variables and constraints. KeywordsInteger programming, Separable quadratic programming, Multidimensional Knapsack Problem, Surrogate relaxation ∗ Corresponding author’s email: [email protected]
منابع مشابه
Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
In this paper we develop a branch-and-bound algorithm for solving a particular integer quadratic multi-knapsack problem. The problem we study is defined as the maximization of a concave separable quadratic objective function over a convex set of linear constraints and bounded integer variables. Our exact solution method is based on the computation of an upper bound and also includes pre-procedu...
متن کاملAn Integer Programming-based Local Search for Large-Scale Multidimensional Knapsack Problems
Integer programming-based local search (IPbLS) is a metaheuristic recently proposed for solving linear combinatorial optimization problems. IPbLS is basically the same as the first-choice hillclimbing except for using integer programming for neighbor generation. Meanwhile, the multidimensional knapsack problem (MKP) is one of the most well-known linear combinatorial optimization problems and ha...
متن کاملOn a Stochastic Bilevel Programming Problem with Knapsack Constraints
In this paper we propose a mixed integer bilevel problem having a probabilistic knapsack constraint in the first level. The problem formulation is mainly motivated by practical pricing and service provision problems as it can be interpreted as a model for the interaction between a service provider and clients. We assume the probability space to be discrete which allows us to reformulate the pro...
متن کاملAn Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem
The multidimensional O-l knapsack problem, defined as a knapsack with multiple resource constraints, is well known to be much more difficult than the single constraint version. This paper deals with the design of an efficient preprocessing procedure for large-scale instances. The algorithm provides sharp lower and upper bounds on the optimal value, and also a tighter equivalent representation b...
متن کاملAn LP with Integrality Gap 1+epsilon for Multidimensional Knapsack
In this note we study packing or covering integer programs with at most k constraints, which are also known as k-dimensional knapsack problems. For integer k > 0 and real ǫ > 0, we observe there is a polynomial-sized LP for the k-dimensional knapsack problem with integrality gap at most 1+ ǫ. The variables may be unbounded or have arbitrary upper bounds. In the (classical) packing case, we can ...
متن کامل